On cyclic codes over the ring $Z_p + uZ_p + ... + u^{k-1}Z_p$
نویسندگان
چکیده
In this paper, we study cyclic codes over the ring Z p + uZ p + · · · + u k−1 Z p , where u k = 0. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes.
منابع مشابه
Cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$
Let p be a prime number. In this paper, we study cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We also characterize the p-ary...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملCyclic codes over $\mathbb{F}_{2^m}[u]/\langle u^k\rangle$ of oddly even length
Let F2m be a finite field of characteristic 2 and R = F2m [u]/〈u 〉 = F2m + uF2m + . . . + u k−1 F2m (u k = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the n...
متن کاملLinear Algebra over Z_p[[u]] and related rings
Let R be a complete discrete valuation ring, S = R[[u]] and d a positive integer. The aim of this paper is to explain how to compute efficiently usual operations such as sum and intersection of sub-S-modules of S. As S is not principal, it is not possible to have a uniform bound on the number of generators of the modules resulting from these operations. We explain how to mitigate this problem, ...
متن کاملCyclic codes of arbitrary length over F q + uF q + u 2 F q + . . . + u k − 1 F
In this paper, we study the structure of cyclic codes of an arbitrary length n over the ring Fq + uFq + uFq + . . . + uFq, where u = 0 and q is a power of prime. Also we study the rank for these codes, and we find their minimal spanning sets. This study is a generalization and extension of the works in references [9] and [12], the dual codes over the ring Fq + uFq + uFq, where u3 = 0 are studie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1205.4148 شماره
صفحات -
تاریخ انتشار 2012